Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
331	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics
332	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
333	CCCG 2010, Winnipeg MB, August 9–11, 2010 Blocking Delaunay Triangulations∗ O. Aichholzer† R. Fabila-Monroy‡ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Mathematics Delaunay triangulation Pitteway triangulation Convex hull Voronoi diagram Relative neighborhood graph Gabriel graph Edge coloring Graph coloring Triangulation Geometry Graph theory
334	CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Dense graph Minor Matroid theory Structural rigidity Shortest path problem Pseudoforest Edge coloring Graph theory Graph coloring Laman graph
335	Complex Networks from Simple Rules Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2013-09-03 11:08:27 Graph theory Structure Graph coloring Theoretical computer science Cybernetics Cellular automaton Complex systems Edge coloring A New Kind of Science Mathematics Systems Cellular automata
336	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
337	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Weak conflict-free colorings of point sets and simple regions Bal´azs Keszegh∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:00 Degeneracy Edge coloring Four color theorem Graph theory Graph coloring Mathematics
338	ICS 163 – Spring 2002 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2002-06-12 18:57:00 Graph Edge coloring Path decomposition Graph theory Planar graphs Graph coloring
339	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Inapproximability of Orthogonal Compaction Michael J. Bannister David Eppstein Joseph A. Simons Computer Science Department, Add to Reading List Source URL: jgaa.info Language: English - Date: 2012-03-09 04:02:51 NP-complete problems Graph coloring Topological graph theory Angular resolution Eulerian path Planar graph Graph Edge coloring Petersen graph Graph theory Mathematics Graph drawing
340	Nonconstructive Tools for Proving Polynomial-Time Decidability MICHAEL R. Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:08 Planar graphs Graph coloring Line graph Robertson–Seymour theorem Graph theory Minor Graph operations

UPDATE